Improvement of Performance in Cryptography
نویسندگان
چکیده
The security of any cryptography algorithm depends upon its key length and block size, by increasing the key length we actually enhance the security of the data being encrypted by a particular algorithm. Depending upon the requirements and confidentiality of the data we use the various cryptography algorithms available till now that may include DES .AES which is a successor of DES having 128-bit key length, SMS4 which also makes use of 128-bit key length, besides these there are many other encryption algorithms in practice. But with the advancement in technology has made the process of cryptanalysis much easier and faster, so in order to secure a highly confidential data of the level of national security, the use of 128-bit key cannot solve the purpose and hence there is need to increase the key length to enhance the security. Keywords— DES, Cryptography, Key length, bits
منابع مشابه
An Introduction to Differential Computation Analysis (DCA) on the withe-box cryptography algorithms
Advances in information and communication technologies lead to use of some new devices such as smart phones. The new devices provide more advantages for the adversaries hence with respect to them, one can define with-box cryptography. In this new model of cryptography, designers try to hide the key using as a kind of implementation. The Differential Computation Analysis (DCA) is a side channel ...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملOn the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes
In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...
متن کاملComparison of two Public Key Cryptosystems
Since the time public-key cryptography was introduced by Diffie andHellman in 1976, numerous public-key algorithms have been proposed. Some of thesealgorithms are insecure and the others that seem secure, many are impractical, eitherthey have too large keys or the cipher text they produce is much longer than theplaintext. This paper focuses on efficient implementation and analysis of two mostpo...
متن کاملمطالعهای بر رمزنگاری بصری و ارائهی روش پیشنهادی برای رمزنگاری تصاویر رنگی
Visual cryptography is a method that makes use of the characteristics of human vision and it requires neither the knowledge of cryptography nor the complex calculations. This method was first proposed by Naor and Shamir, its implementation is simple, it has been extended to an secrect sharing (k, n) in which n shares are made from the image and they are distributed among n participants. Moreov...
متن کاملInvestigating Methods of Kleptography
Due to the fast development in information and communication technology, new challenging problems appear in the security. So, it is important and vital that the scientific society of our country focuses on research and studies these problems and by providing new proposal try to respond to these critical needs of our country. Hence, our aim in this paper is to study and highlight one of the impo...
متن کامل